SequencesViewer  Visualisation de s%E9quences ordonn%E9es de g%E8nes ou comment rendre accessible des motifs s%E9quentiels trop nombreux %3F

Requ%EAtes Skyline avec prise en compte des pr%E9f%E9rences utilisateurs pour des donn%E9es volumineuses.

Requ%EAtes Skyline avec prise en compte des pr%E9f%E9rences utilisateurs pour des donn%E9es volumineuses.

Bien cube%2C les donn%E9es textuelles peuvent s%27agr%E9ger %21

Intelligent Energy Data Warehouse What Challenges%3F

Mining multidimensional and multilevel sequential patterns.

Discovering Novelty in Gene Data From Sequential Patterns to Visualization.

Mining multidimensional and multilevel sequential patterns.

Mining Discriminant Sequential Patterns for Aging Brain.

Using OWA operators for gene sequential pattern clustering.

Extraction efficace de r%E8gles graduelles.

D%E9tection de s%E9quences atypiques bas%E9e sur un mod%E8le de Markov d%27ordre variable.

DEMON DEcouverte de MOtifs s%E9quentiels pour les puces adN.

DEMON%2DVisualisation un outil pour la visualisation des motifs s%E9quentiels extraits %E0 partir de donn%E9es biologiques.

Mining Frequent Gradual Itemsets from Large Databases.

SMSDAdn %2D Motifs S%E9quentiels Discriminants pour les puces ADN.

GeneMining Identification

Efficient mining of sequential patterns with time constraints Reducing the combinations.

FTMnodes Fuzzy tree mining based on partial inclusion.

FTMnodes Fuzzy tree mining based on partial inclusion.

Mining convergent and divergent sequences in multidimensional data.

Evolution patterns and gradual trends.

Softening the blow of frequent sequence analysis soft constraints and temporal accuracy.

Tree mining Equivalence classes for candidate generation.

S2MP Similarity Measure for Sequential Patterns.
In data mining, computing the similarity of objects is an essential task, for example to identify regularities or to build homogeneous clusters of objects. In the case of sequential data seen in various fields of application (e.g. series of customers purchases, Internet navigation) this problem (i.e. comparing the similarity of sequences) is very important. There are already some similarity measures as Edit distance and LCS suited to simple sequences, but these measures are not relevant in the case of complex sequences composed of sets of items, as is the case of sequential patterns. In this paper, we propose a new similarity measure taking the characteristics of sequential patterns into account. S 2 MP is an adjustable measure depending on the importance given to each characteristic of sequential patterns according to context, which is not the case of existing measures. We have experimented the accuracy and quality of S 2 MP against Edit distance by using them in a clustering of sequential patterns. The results show that the clusters obtained by S 2 MP are more homogeneous. Moreover these cluster are more precise and more complete according to the clusters obtained using Edit distance. The experiments show also that S 2 MP is efficient in term of calculation time and size of used memory.
Fast extraction of gradual association rules a heuristic based method.

FFTM optimized frequent tree mining with soft embedding constraints on siblings.

Up and Down Mining Multidimensional Sequential Patterns Using Hierarchies.

Learning Bayesian Network Structure from Incomplete Data without Any Assumption.

Up and Down Mining Multidimensional Sequential Patterns Using Hierarchies.



Detection of Sequential Outliers Using a Variable Length Markov Model.

Des s%E9quences aux tendances.

Sequential Patterns for Maintaining Ontologies over Time.

Web usage mining extracting unexpected periods from web logs.
Existing Web Usage Mining techniques are currently based on an arbitrary division of the data (e.g. &#034;one log per month&#034;) or guided by presumed results (e.g &#034;what is the customers behaviour for the period of Christmas purchases?&#034;). Those approaches have two main drawbacks. First, they depend on this arbitrary organization of the data. Second, they cannot automatically extract seasons peaks among the stored data. In this paper, we propose to perform a specific data mining process (and particularly to extract frequent behaviours) in order to automatically discover the densest periods. Our method extracts, among the whole set of possible combinations, the frequent sequential patterns related to the extracted periods. A period will be considered as dense if it contains at least one frequent sequential pattern for the set of users connected to the Web site in that period. Our experiments show that the extracted periods are relevant and our approach is able to extract both frequent sequential patterns and the associated dense periods. 
Motifs s%E9quentiels multidimensionnels et mesure. Diff%E9rentes techniques pour calculer le support.

Enrichissement d%27ontologie Quand les motifs s%E9quentiels labellisent des relations.

Mining unexpected multidimensional rules.

Extraction de s%E9quences multidimensionnelles convergentes et divergentes.

SPoID  Extraction de motifs s%E9quentiels pour les bases de donn%E9es incompl%E8tes.

SPoID Do Not Throw Meaningful Incomplete Sequences Away%21.
Industrial databases often contain a large amount of unfilled information. During the knowledge discovery process one processing step is often necessary in order to remove these incomplete data either by deleting or assessing them. When the data mining task consists in mining for frequent sequences, incomplete data are, most of the time, deleted, which leads to an important loss of information. Extracted knowledge then becomes less representative of the database. Therefore we propose a method that uses the partial information contained in incomplete records, only temporary ignoring the missing part of the record. Experiments run on various synthetic datasets show the validity of our proposal as well in terms of quality as in terms of the robustness to the rate of missing values.
Approximate Sequential Patterns for Incomplete Sequence Database Mining.

On Transversal Hypergraph Enumeration in Mining Sequential Patterns.

Extended Time Constraints for Sequence Mining.

Fuzzy Tree Mining Go Soft on Your Nodes.
Abstract. Tree mining consists in discovering the frequent subtrees from a forest of trees. This problem has many application areas. For instance, a huge volume of data available from the Internet is now described by trees (e.g. XML). Still, for several documents dealing with the same topic, this description is not always the same. It is thus necessary to mine a common structure in order to query these documents. Biology is another field where data may be described by means of trees. The problem of mining trees has now been addressed for several years, leading to well-known algorithms. However, these algorithms can hardly deal with real data in a soft manner. Indeed, they consider a subtree as fully included in the super-tree. This means that all the nodes must appear. In this paper, we extend this definition to fuzzy inclusion based on the idea that a tree is included to a certain degree within another one, this fuzzy degree being correlated to the number of matching nodes. 1
Extended Time Constraints for Sequence Mining.



Pr%E9servation de la vie priv%E9e. Recherche de motifs s%E9quentiels dans des bases de donn%E9es distribu%E9es.

Towards a new approach for mining frequent itemsets on data stream.

Peer%2Dto%2DPeer Usage Analysis a Distributed Mining Approach.

Privacy Preserving Sequential Pattern Mining in Distributed Databases.

Privacy preserving sequential pattern mining in distributed databases.

HYPE mining hierarchical sequential patterns.

Web Usage Mining  extraction de p%E9riodes denses %E0 partir des logs.

Fouille de donn%E9es dans les syst%E8mes Pair%2D%E0%2DPair pour am%E9liorer la recherche de ressources.

Recherche de sous%2Dstructures fr%E9quentes pour l%27int%E9gration de sch%E9mas XML.

Des motifs s%E9quentiels g%E9n%E9ralis%E9s aux contraintes de temps %E9tendues.

Sequential patterns for text categorization.

Mining spatio%2Dtemporal data.
In this article, we apply the independent component analysis technique for mining spatio-temporal data. The technique has been applied to mine for patterns in weather data using the North Atlantic Oscillation (NAO) as a specific example. We find that the strongest independent components match the observed synoptic weather patterns corresponding to the NAO. We also validate our results by matching the independent component activities with the NAO index.
Need For Speed  Mining Sequential Patterns in Data Streams.
Abstract — Recently, the data mining community has focused on a new challenging model where data arrives sequentially in the form of continuous rapid streams. It is often referred to as data streams or streaming data. Many real-world applications data are more appropriately handled by the data stream model than by traditional static databases. Such applications can be: stock tickers, network traffic measurements, transaction flows in retail chains, click streams, sensor networks and telecommunications call records. In this paper we propose a new approach, called SPEED (Sequential Patterns Efficient Extraction in Data streams), to identify sequential patterns in a data stream. To the best of our knowledge this is the first approach defined for mining sequential patterns in streaming data. The main originality of our mining method is that we use a novel data structure to maintain frequent sequential patterns coupled with a fast pruning strategy. At any time, users can issue requests for frequent sequences over an arbitrary time interval. Furthermore, our approach produces an approximate support answer with an assurance that it will not bypass a user-defined frequency error threshold. Finally the proposed method is analyzed by a series of experiments on different datasets. I.
Motifs s%E9quentiels multidimensionnels %E9toil%E9s.

Need For Speed  Mining Sequential Patterns in Data Streams.
Abstract — Recently, the data mining community has focused on a new challenging model where data arrives sequentially in the form of continuous rapid streams. It is often referred to as data streams or streaming data. Many real-world applications data are more appropriately handled by the data stream model than by traditional static databases. Such applications can be: stock tickers, network traffic measurements, transaction flows in retail chains, click streams, sensor networks and telecommunications call records. In this paper we propose a new approach, called SPEED (Sequential Patterns Efficient Extraction in Data streams), to identify sequential patterns in a data stream. To the best of our knowledge this is the first approach defined for mining sequential patterns in streaming data. The main originality of our mining method is that we use a novel data structure to maintain frequent sequential patterns coupled with a fast pruning strategy. At any time, users can issue requests for frequent sequences over an arbitrary time interval. Furthermore, our approach produces an approximate support answer with an assurance that it will not bypass a user-defined frequency error threshold. Finally the proposed method is analyzed by a series of experiments on different datasets. I.
Motifs s%E9quentiels flous  un peu%2C beaucoup%2C passionn%E9ment.

RSF %2D A New Tree Mining Approach with an Ecient Data Structure.

M2SP Mining Sequential Patterns Among Several Dimensions.

Ordre et d%E9sordre dans la cat%E9gorisation de textes.

Les r%E8gles d%27association comme outil de cat%E9gorisation textuelle.

Where%27s Charlie Family%2DBased Heuristics for Peer%2Dto%2DPeer Schema Integration.

Where%27s Charlie Family%2DBased Heuristics for Peer%2Dto%2DPeer Schema Integration.

Pre%2DProcessing Time Constraints for Efficiently Mining Generalized Sequential Patterns.

Extraction de motifs s%E9quentiels. Probl%E8mes et m%E9thodes.

AUSMS An Environment for Frequent Sub%2Dstructures Extraction in a Semi%2Dstructured Object Collection.

Web Usage Mining Extraction%2C Maintenance and Behaviour Trends.

Classification automatique de documents. La mesure des deux %E9carts.

Incremental mining of sequential patterns in large databases.
In this paper we consider the problem of the incremental mining of sequential patterns when new transactions or new customers are added to an original database. We present a new algorithm for mining frequent sequences that uses information collected during an earlier mining process to cut down the cost of finding new sequential patterns in the updated database. Our test shows that the algorithm performs significantly faster than the naive approach of mining on the whole updated database from scratch. The difference is so pronounced that this algorithm could also be useful for mining sequential patterns, since in many cases it is faster to apply our algorithm than to mine sequential patterns using a standard algorithm, by breaking down the database into an original database plus an increment. Key words: Sequential patterns, incremental mining, data mining 1
Donn%E9es semi%2Dstructur%E9es. D%E9couverte

HDM A Client%2FServer%2FEngine Architecture for Real%2DTime Web Usage Mining.

HDM
The Enhanced HDM Specification and Verification System being  developed at SRI International includes an &#034;MLS Checker&#034; that automatically  verifies the security of a certain class of system specifications.
Real Time Web Usage Mining with a Distributed Navigation Analysis.

Web Usage Mining Inter%2DSites Analyse du comportement des utilisateurs %E0 impact imm%E9diat.

Real%2DTime Web Usage Mining A Heuristic Based Distributed Miner.

A General Architecture for Finding Structural Regularities on the Web.
With the growing popularity of the World Wide Web, the number of semistructured documents  produced in all types of organizations increases at a rapid rate. However the provided information  cannot be queried or manipulated in the general way since, although there is some structure in the  information, it is too irregular to be modeled using a relational or an object-oriented approach.  Nevertheless, some semistructured objects, for the same type of information, have a very similar  structure. Analysis of such regularities can provide very useful information for restructuring a Web  site, for providing a guideline for building indexes and views and in a general way for applying  conventional database technologies which are mainly schema dependent.  In this paper we address the problem of nding such regularities and we propose a general architecture  based on a data mining technique.  1 Introduction  With the growing popularity of the World Wide Web (Web), the number of semistructured ...
Web Usage Mining How to Efficiently Manage New Transactions and New Clients.

Incremental Mining of Sequential Patterns in Large Databases.
In this paper we consider the problem of the incremental mining of sequential patterns when new transactions or new customers are added to an original database. We present a new algorithm for mining frequent sequences that uses information collected during an earlier mining process to cut down the cost of finding new sequential patterns in the updated database. Our test shows that the algorithm performs significantly faster than the naive approach of mining on the whole updated database from scratch. The difference is so pronounced that this algorithm could also be useful for mining sequential patterns, since in many cases it is faster to apply our algorithm than to mine sequential patterns using a standard algorithm, by breaking down the database into an original database plus an increment. Key words: Sequential patterns, incremental mining, data mining 1
Web Usage Mining How to Efficiently Manage New Transactions and New Clients.



Extraction efficace de motifs s%E9quentiels  le pr%E9traitement des donn%E9es.

Activity Threads A Unified Framework for Aiding Behavioural Modelling.

Une Aide %E0 la conception et au Contr%F4le de R%E8gles actives.

Une Aide %E0 la conception et au Contr%F4le de R%E8gles actives.

Views for Information System Design without Reorganization.

Mod%E9lisation et validation comportementales.

Event Schema Updating.

Behavioural Constraints Using Events.

Dynamic Modelling with Events
Abstract The 1999 M 7.1 Hector Mine earthquake ruptured a complex fault system with a branched structure in the north. This fault geometry and slip pattern presents a puzzle, because the northwest branch of this system should be in the stress shadow of the north branch, upon which nucleation likely took place. Through 3D dynamic models of this event, we show that the ability of rupture to propagate to the northwest branch most likely depends on the fact that rupture did not proceed to the surface on the north branch. This slip pattern leads to part of the northwest branch being brought above its failure stress and to subsequent rupture propagation and slip occurring on that branch. A similar effect can be seen in the case in which rupture is constrained not to propagate to the base of the north branch. Models with slip over the entire north branch do not produce rupture propagation and slip on the northwest branch. The results are robust with respect to details of the prestress pattern and hypocenter location. Large heterogeneity over small length scales in the final stress pattern is a natural product of the models, even when the initial stress field is quite homogeneous. We also find that the interaction between fault geometry and stress pattern helps to explain other observations in this event, including slow rupture propagation on the northwest branch. The results help to show that 3D dynamic effects may be crucial in determining rupture propagation and slip behavior on geometrically complex fault systems, although these effects may be hard to predict without detailed knowledge of the stress pattern and fault geometry prior to earthquakes.
IFO2 a Uniform Approach for Information System Modelling.

An Algebraic Language for Event%2DDriven Modelling.

Towards Event%2DDriven Modelling for Database Design.
ion Pattern. In Proceedings of the Twentieth International Conference on Very Large Databases, pages 630--641, Santiago, Chile, 1994. Materialization is a useful abstraction pattern that can be identified in many application settings. Intuitively, materialization is the relationship between a class of categories (e.g., models of cars) and a class of more concrete objects (e.g., individual cars). The talk gives a precise semantic definition of materialization in terms of the usual is-a and is-of abstractions, and of the class/metaclass correspondence. New and powerful inheritance mechanisms are associated with materialization. Examples, properties, and extensions of materialization are also presented. Providing materialization as an abstraction mechanism for conceptual modeling enhances expressiveness by a controled introduction of classification at the application level.  (4) integration of disparate information systems, (5) re-documentation, (6) data quality assessment and assurance,...
Towards a Formal Approach for Object Database Design.
This paper focuses on a formal approach * for advanced database modeling and design. It is based on the IF02 model, an extension of the semantic model IF0 defined by S. Abiteboul and R. Hull. It preserves the acquired
IFO2
The first step for developing an heterogeneous federated database consists in translating local schemas into a canonical data model. This paper offers a method to transform a relational schema into an equivalent object-oriented one. We study in particular the translation of the nary relationship tables (n&gt;2). The canonical data model we are using is the IFO 2 data model [16], [17], [24]. We translate a relational schema through a combination of data schema and data instance analysis into three stages : deduction of the IFO  2  basic types, deduction of IFO  2  edges and functions, deduction of IFO 2 fragments.  1 Introduction  Following the five level schema architecture of [19], when preexisting databases are to interoperate, a canonical data model common to the whole federation must be adopted. The schemas of the local databases are transformed from their native models to the canonical model giving component schemas. Each component schema is filtered into one or more export schemas. ...
